#include "mainHeader.h"
#define FALSE 0
#define TRUE 1
#define HASH_TABLE_SIZE 53

struct bst{
	//long abspath ;
	char abspath[100];
	long blockNumber ;
	struct bst *left ;
	struct bst *right;
	struct bst *parent;
};
char *absolutePathForBST;
//linked list structure for hashtable
typedef struct entry {
	int id;
	char *filename;
	long int blockNo;
	char *filePath;
	struct entry *next;
}node;

//hash table structure
typedef struct hashtable{
	int size;
	node **table;
}ht;


// structure of nAry node
typedef struct nAryTreeNode{
	/*descriptors descriptor;
	struct node* parent;
	struct node* lchild;
	struct node* rsibling;*/
	char *name;
	struct nAryTreeNode *child;
	struct nAryTreeNode *sibling;
}nAryNode;

